منابع مشابه
Packing Steiner Trees: Further Facets
In this paper we continue the investigations in GMW92a] for the Stei-ner tree packing polyhedron. We present several new classes of valid inequalities and give suucient (and necessary) conditions for these inequalities to be facet-deening. It is intended to incorporate these inequalities into an existing cutting plane algorithm that is applicable to practical problems arising in the design of e...
متن کاملPacking Steiner trees
Let T be a distinguished subset of vertices in a graph G. A T Steiner tree is a subgraph of G that is a tree and that spans T . Kriesell conjectured that G contains k pairwise edge-disjoint T -Steiner trees provided that every edge-cut of G that separates T has size ≥ 2k. When T = V (G) a T -Steiner tree is a spanning tree and the conjecture is a consequence of a classic theorem due to Nash-Wil...
متن کاملPacking Steiner trees: polyhedral investigations
Let G = (V; E) be a graph and T V be a node set. We call an edge set S a Steiner tree with respect to T if S connects all pairs of nodes in T. In this paper we address the following problem, which we call the weighted Steiner tree packing problem. Given a graph G = (V; E) with edge weights w e , edge capacities a Steiner tree with respect to T k , at most c e of these edge sets use edge e for e...
متن کاملPacking Steiner Trees: Separation Algorithms
In this paper we investigate separation problems for classes of inequalities valid for the polytope associated with the Steiner tree packing problem , a problem that arises, e. g., in VLSI routing. The separation problem for Steiner partition inequalities is NP-hard in general. We show that it can be solved in polynomial time for those instances that come up in switchbox routing. Our algorithm ...
متن کاملThe cavity approach for Steiner trees Packing problems
The Belief Propagation approximation, or cavity method, has been recently applied to several combinatorial optimization problems in its zero-temperature implementation, the Max-Sum algorithm. In particular, recent developments to solve the Edge-Disjoint paths problem and the Prize collecting Steiner tree Problem on graphs have shown remarkable results for several classes of graphs and for bench...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1996
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0004